Dynamic stochastic approximation for multi-stage stochastic optimization
نویسندگان
چکیده
منابع مشابه
Dynamic Stochastic Approximation for Multi-stage Stochastic Optimization
In this paper, we consider multi-stage stochastic optimization problems with convex objectives and conic constraints at each stage. We present a new stochastic first-order method, namely the dynamic stochastic approximation (DSA) algorithm, for solving these types of stochastic optimization problems. We show that DSA can achieve an optimal O(1/ǫ4) rate of convergence in terms of the total numbe...
متن کاملApproximation Algorithms for 2-stage and Multi-stage Stochastic Optimization
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizations of the data. We consider the well-studied paradigm of stochastic recourse models, in which the realized input is revealed through a series of stages and one can take decisions in each stage in response to the new in...
متن کاملManaging Risk using Multi-Stage Stochastic Optimization
The paper discusses the application of multi-stage stochastic optimization for managing and optimizing expected returns versus risk, and contrasts static (single-stage) versus dynamic (multi-stage) portfolio optimization. We present how to best fund a pool of similar fixed rate mortgages through issuing bonds, callable and non-callable, of various maturities using stochastic optimization. We di...
متن کاملThe Sample Average Approximation Method for 2-stage Stochastic Optimization
We consider the Sample Average Approximation (SAA) method for 2-stage stochastic optimization problems with recourse and prove a polynomial time convergence theorem for the SAA method. In the 2-stage recourse model, where one makes decisions in two steps. First, given only distributional information about (some of) the data, one commits on initial (first-stage) actions, and then once the actual...
متن کاملAlgorithms Column: Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Uncertainty is a facet of many decision environments and might arise for various reasons, such as unpredictable information revealed in the future, or inherent fluctuations caused by noise. Stochastic optimization provides a means to handle uncertainty by modeling it by a probability distribution over possible realizations of the actual data, called scenarios. The field of stochastic optimizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2020
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-020-01489-y